LibCoopt: A library for combinatorial optimization on partial permutation matrices
نویسندگان
چکیده
LibCoopt is an open-source matlab code library which provides a general and convenient tool to approximately solve the combinatorial optimization problems on the set of partial permutation matrices, which are frequently encountered in computer vision, bioinformatics, social analysis, etc. To use the library, the user needs only to give the objective function and its gradient function associated with the problem. Two typical problems, the subgraph matching problem and the quadratic assignment problem, are employed to illustrate how to use the library and also its flexibility on different types of problems.
منابع مشابه
Approximating Orthogonal Matrices by Permutation Matrices
Motivated in part by a problem of combinatorial optimization and in part by analogies with quantum computations, we consider approximations of orthogonal matrices U by “non-commutative convex combinations”A of permutation matrices of the type A = P Aσσ, where σ are permutation matrices and Aσ are positive semidefinite n × n matrices summing up to the identity matrix. We prove that for every n× ...
متن کاملPartial Transpose of Permutation Matrices
The main purpose of this paper is to look at the notion of partial transpose from the combinatorial side. In this perspective, we solve some basic enumeration problems involving partial transpose of permutation matrices. Specifically, we count the number of permutations matrices which are invariant under partial transpose. We count the number of permutation matrices which are still permutation ...
متن کاملA Weighted Common Subgraph Matching Algorithm
We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of the equal-sized graph matching or subgraph matching, finds wide applications in many computer vision and machine learning tasks. In this paper, the WCS matching is first formulated as a combinatorial optimization problem o...
متن کاملPartial Transposes of Permutation Matrices
The partial transpose of a block matrix M is the matrix obtained by transposing the blocks of M independently. We approach the notion of the partial transpose from a combinatorial point of view. In this perspective, we solve some basic enumeration problems concerning the partial transpose of permutation matrices. More specifically, we count the number of permutations matrices which are invarian...
متن کاملReparameterizing the Birkhoff Polytope for Variational Permutation Inference
Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation, but fully Bayesian inference poses a severe challenge in this highdimensional, discrete space. To surmount this challenge, we start with the usual step of rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Neurocomputing
دوره 237 شماره
صفحات -
تاریخ انتشار 2017